More flexible and robust deriving code #6267
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This "finishes" the generic deriving code (which I started in #5640), in the sense it supports everything that I can think of being useful. (Including lifetimes and type parameters on methods and traits, arguments and return values of (almost) any type, static methods.)
It closes #6149, but met with #6257, so the following doesn't work:
(It only fails for
TotalOrd
,TotalEq
andClone
, since they are the only ones that call a method directly on sub-elements of the type, which means that the auto-deref interferes with the pointer.)It also makes
Rand
(chooses a random variant, fills the fields with random values, including recursively for recursive types) andToStr
(x.to_str()
is the same asfmt!("%?", x)
) derivable, as well as converting IterBytes to the generic code (which made the code 2.5x shorter, more robust and added support for tuple structs).({En,De}codable are trickier, so I'll convert them over later.)